Probabilistic complexity theory - PDFSEARCH.IO - Document Search Engine

Probabilistic complexity theory
Results: 385

#	Item
71	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 How to Cover Most of a Point Set with a V-Shape of Minimum Width Boris Aronov∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2013-08-11 21:51:58 Probabilistic complexity theory Randomized algorithm Outlier Algorithm RANSAC CURE data clustering algorithm Statistics Robust statistics Analysis of algorithms
72	Distributed Agreement with Optimal Communication Complexity Seth Gilbert EPFL Abstract We consider the problem of fault-tolerant agreement in Add to Reading List Source URL: www.comp.nus.edu.sg Language: English - Date: 2009-11-24 09:45:55 Analysis of algorithms Fault-tolerant computer systems Probabilistic complexity theory Consensus Randomized algorithm Distributed algorithm Factorial IP Time complexity Theoretical computer science Computational complexity theory Mathematics
73	Route Search over Probabilistic Geospatial Data Yaron Kanza1, , Eliyahu Safra2 , and Yehoshua Sagiv3, 1 2 Technion—Israel Institute of Technology Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2009-05-26 06:50:03 Approximation algorithm Computational complexity theory Travelling salesman problem Statistical hypothesis testing Theoretical computer science Statistics Applied mathematics
74	Three Dimensional Bin Packing Problem with Variable Bin Height Yong Wu a,b,∗ , Wenkai Li b , Mark Goh b,c , Robert de Souza b a Institute b The Add to Reading List Source URL: www98.griffith.edu.au Language: English - Date: 2011-05-11 13:37:50 Packaging Operations research Discrete geometry Bin packing problem Mathematical optimization Computational complexity theory Packing problem Carton Bounded-error probabilistic polynomial Theoretical computer science Mathematics Applied mathematics
75	Finding a path of length k in O∗(2k ) time arXiv:0807.3026v3 [cs.DS] 9 Nov 2008 Ryan Williams∗ Carnegie Mellon University Add to Reading List Source URL: arxiv.org Language: English - Date: 2008-11-08 20:04:23 Analysis of algorithms Polynomials Probabilistic complexity theory Randomized algorithm Matching Schwartz–Zippel lemma Time complexity NP Color-coding Theoretical computer science Applied mathematics Mathematics
76	On the Complexity of Numerical Analysis Eric Allender Rutgers, the State University of NJ Department of Computer Science Piscataway, NJ, USA Add to Reading List Source URL: ftp.cs.rutgers.edu Language: English - Date: 2008-12-08 14:23:03 Complexity classes Polynomial Advice P Reduction Time complexity Bounded-error probabilistic polynomial Circuit complexity Theoretical computer science Computational complexity theory Applied mathematics
77	Uniform Generation of NP-witnesses using an NP-oracle Mihir Bellare Oded Goldreichy Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2014-06-22 06:24:53 Complexity classes Probabilistic complexity theory Quantum complexity theory Analysis of algorithms Randomized algorithm PP NP P Theoretical computer science Computational complexity theory Applied mathematics
78	Presburger Award 2012 The Presburger Award Committee 2012, consisting of Monika Henzinger, Antonin Kucera, and Stefano Leonardi (chair) has unanimously decided to propose *********************************************** Add to Reading List Source URL: www.eatcs.org Language: English - Date: 2014-01-29 10:45:05** Applied mathematics Mathematics Computational complexity theory List decoding Venkatesan Guruswami Probabilistic complexity theory Presburger Award Reed–Solomon error correction Probabilistically checkable proof Error detection and correction Theoretical computer science Coding theory
79	Fast Randomized Test-and-Set and Renaming Dan Alistarh1 , Hagit Attiya1,2 , Seth Gilbert1 , Andrei Giurgiu1 , and Rachid Guerraoui1 1 Ecole Polytechnique F´ed´erale de Lausanne, Lausanne, Switzerland 2 Add to Reading List Source URL: www.comp.nus.edu.sg Language: English - Date: 2011-11-17 23:45:01 Analysis of algorithms Computational complexity theory Probabilistic complexity theory Randomized algorithm Algorithm Complexity Consensus Adversary model In-place algorithm Theoretical computer science Applied mathematics Mathematics
80	Exact and Approximate Probabilistic Symbolic Execution for Nondeterministic Programs Kasper S. Luckow ˘ areanu ˘ Add to Reading List Source URL: www.cs.sun.ac.za Language: English - Date: 2014-09-18 09:08:01 Complexity classes Probabilistic complexity theory Analysis of algorithms Randomized algorithm NL PP Algorithm Monte Carlo method Scheduling Theoretical computer science Computational complexity theory Applied mathematics

UPDATE